Effective longest and infinite reduction paths in untyped λ-calculi
Identifieur interne : 002811 ( Main/Exploration ); précédent : 002810; suivant : 002812Effective longest and infinite reduction paths in untyped λ-calculi
Auteurs : Heine S Rensen [Pays-Bas, Danemark]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Abstract
Abstract: A maximal reduction strategy in untyped λ-calculus computes for a term a longest (finite or infinite) reduction path. Some types of reduction strategies in untyped λ-calculus have been studied, but maximal strategies have received less attention. We give a systematic study of maximal strategies, recasting the few known results in our framework and giving a number of new results, the most important of which is an effective maximal strategy in λΒη. We also present a number of applications illustrating the relevance and usefulness of maximal strategies.
Url:
DOI: 10.1007/3-540-61064-2_44
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002648
- to stream Istex, to step Curation: 002474
- to stream Istex, to step Checkpoint: 001C22
- to stream Main, to step Merge: 002955
- to stream Main, to step Curation: 002811
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Effective longest and infinite reduction paths in untyped λ-calculi</title><author><name sortKey="S Rensen, Heine" sort="S Rensen, Heine" uniqKey="S Rensen H" first="Heine" last="S Rensen">Heine S Rensen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DD60B3F5D5F503F06AF92306746716D902DE2DD6</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61064-2_44</idno><idno type="url">https://api.istex.fr/document/DD60B3F5D5F503F06AF92306746716D902DE2DD6/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002648</idno><idno type="wicri:Area/Istex/Curation">002474</idno><idno type="wicri:Area/Istex/Checkpoint">001C22</idno><idno type="wicri:doubleKey">0302-9743:1996:S Rensen H:effective:longest:and</idno><idno type="wicri:Area/Main/Merge">002955</idno><idno type="wicri:Area/Main/Curation">002811</idno><idno type="wicri:Area/Main/Exploration">002811</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Effective longest and infinite reduction paths in untyped λ-calculi</title><author><name sortKey="S Rensen, Heine" sort="S Rensen, Heine" uniqKey="S Rensen H" first="Heine" last="S Rensen">Heine S Rensen</name><affiliation wicri:level="1"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Faculty of Mathematics & Informatics, Catholic University of Nijmegen (KUN)</wicri:regionArea><wicri:noRegion>Catholic University of Nijmegen (KUN)</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Department of Computer Science, University of Copenhagen (DIKU)</wicri:regionArea><wicri:noRegion>University of Copenhagen (DIKU)</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Danemark</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">DD60B3F5D5F503F06AF92306746716D902DE2DD6</idno><idno type="DOI">10.1007/3-540-61064-2_44</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A maximal reduction strategy in untyped λ-calculus computes for a term a longest (finite or infinite) reduction path. Some types of reduction strategies in untyped λ-calculus have been studied, but maximal strategies have received less attention. We give a systematic study of maximal strategies, recasting the few known results in our framework and giving a number of new results, the most important of which is an effective maximal strategy in λΒη. We also present a number of applications illustrating the relevance and usefulness of maximal strategies.</div></front></TEI><affiliations><list><country><li>Danemark</li><li>Pays-Bas</li></country></list><tree><country name="Pays-Bas"><noRegion><name sortKey="S Rensen, Heine" sort="S Rensen, Heine" uniqKey="S Rensen H" first="Heine" last="S Rensen">Heine S Rensen</name></noRegion><name sortKey="S Rensen, Heine" sort="S Rensen, Heine" uniqKey="S Rensen H" first="Heine" last="S Rensen">Heine S Rensen</name></country><country name="Danemark"><noRegion><name sortKey="S Rensen, Heine" sort="S Rensen, Heine" uniqKey="S Rensen H" first="Heine" last="S Rensen">Heine S Rensen</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002811 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002811 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:DD60B3F5D5F503F06AF92306746716D902DE2DD6
|texte= Effective longest and infinite reduction paths in untyped λ-calculi
}}
| This area was generated with Dilib version V0.6.32. |  |